Finding Con ict Sets and Backtrack Points in CLP
نویسندگان
چکیده
This paper presents a method for intelligent backtracking in CLP Our method integrates a depth rst intelligent backtracking algorithm developed for logic programming with an original constraint satisfaction algorithm which naturally generates sets of con icting constraints We prove that if CLP is assumed to cover strictly the domain of real numbers then the constraint satisfaction algorithm provides minimal con ict sets to be used as a basis for intelligent backtracking We then extend the backtrack ing method to cover a two sorted domain where variables can be bound to either structured terms or real numbers We discuss a practical implementa tion of the algorithm using a generator consumer approach to the recording of variable bindings and we give an example of a CLP program which bene ts signi cantly from intelligent backtracking
منابع مشابه
Finding Connict Sets and Backtrack Points in Clp(<)
This paper presents a method for intelligent backtracking in CLP(<). Our method integrates a depth-rst intelligent backtracking algorithm developed for logic programming with an original constraint satisfaction algorithm which naturally generates sets of connicting constraints. We prove that if CLP(<) is assumed to cover strictly the domain of real numbers, then the constraint satisfaction algo...
متن کاملCDCL with Less Destructive Backtracking through Partial Ordering
Con ict-driven clause learning is currently the most e cient complete algorithm for satis ability solving. However, a con ict-directed backtrack deletes potentially large portions of the current assignment that have no direct relation with the con ict. In this paper, we show that the CDCL algorithm can be generalized with a partial ordering on decision levels. This allows keeping levels that wo...
متن کاملBanach Center Publications Volume Institute of Mathematics Polish Academy of Sciences Warszawa Properties of Conflict Sets in the Plane
This paper studies the smoothness and the curvature of con ict sets of the dis tance function in the plane Con ict sets are also well known as bisectors We prove smoothness in the case of two convex sets and give a formula for the curvature We generalize moreover to weighted distance functions the so called Johnson Mehl model Introduction We consider two regions in the Euclidean plane A classic...
متن کاملConvergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems
In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...
متن کاملComments on the Theory of Measurement in Diagnosis from First Principles
When ®nding diagnoses from ®rst principles, one needs to re®ne possible diagnoses by making measurements from the system being diagnosed. Based on the work of Reiter, Hou has developed and formalized an ecient incremental method for computing all diagnoses upon measurement. However, we feel that some points in HouÕs paper need clari®cations. In this paper, we describe an elaborate picture of t...
متن کامل